Papers with gradient-free Monte Carlo Tree Search
Direct Behavior Optimization: Unlocking the Potential of Lightweight LLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing prompt optimization methods rely on extensive manual effort or meta-cognitive abilities, making them less effective for LwLLMs. |
| Approach: | They propose a direct behavior optimization parameter that transforms the optimization of complex prompts into discrete, quantifiable execution sequences using a gradient-free Monte Carlo Tree Search. |
| Outcome: | The proposed method outperforms current prompt optimization methods on seven challenging tasks where state-of-the-art LLMs excel but LwLLMs generally underperform. |